Analysis of Emerging Field Related to Distributed Concurrency control
نویسندگان
چکیده
منابع مشابه
A Unified Approach to Distributed Concurrency Control
A unified model for distributed concurrency control is presented, which enables the system to utilise the semantics of an application. We assume that concurrent accesses to data are made by transactions and that data objects are instances of abstract types. The semantics of an application is given to the system by the application programmer using a specification language. In this way any change...
متن کاملA Sophisticate's'introduction to Distributed Database Concurrency Control;'
Dozens of articles have been published describing "new" concurrency control algorithms for distributed database systems. All of these algorithms can be derived and understood using a few basic concepts. We show how to decompose the concurrency control problem into several subproblems, each of which has iust a few known solutions. By appropriately combining known solutions to the subproblems, we...
متن کاملAn Evaluation of Distributed Concurrency Control
Increasing transaction volumes have led to a resurgence of interest in distributed transaction processing. In particular, partitioning data across several servers can improve throughput by allowing servers to process transactions in parallel. But executing transactions across servers limits the scalability and performance of these systems. In this paper, we quantify the effects of distribution ...
متن کاملAn Introductory Tutorial to Concurrency-Related Distributed Recursion
Recursion is a fundamental concept of sequential computing that allows for the design of simple and elegant algorithms. Recursion is also used in both parallel or distributed computing to operate on data structures, mainly by exploiting data independence (independent data being processed concurrently). This paper is a short introduction to recursive algorithms that compute tasks in asynchronous...
متن کاملOptimistic Concurrency Control for Distributed Unsupervised Learning
Research on distributed machine learning algorithms has focused primarily on one of two extremes—algorithms that obey strict concurrency constraints or algorithms that obey few or no such constraints. We consider an intermediate alternative in which algorithms optimistically assume that conflicts are unlikely and if conflicts do arise a conflict-resolution protocol is invoked. We view this “opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2018
ISSN: 2321-9653
DOI: 10.22214/ijraset.2018.1434